ArticleRank: a PageRank-based alternative to numbers of citations for analysing citation networks

نویسندگان

  • Jiang Li
  • Peter Willett
چکیده

Structured Abstract. Purpose: The paper suggests an alternative to the widely used Times Cited criterion for analysing citation networks. The approach involves taking account of the natures of the papers that cite a given paper, so as to differentiate between papers that attract the same number of citations. Method: ArticleRank is an algorithm that has been derived from Google's PageRank algorithm to measure the influence of journal articles, as an alternative to the long-established Times Cited indicator. ArticleRank is applied to two datasets-a citation network based on an early paper on webometrics, and a self-citation network based on the 19 most cited papers in the Journal of Documentation – using citation data taken from the Web of Knowledge database. Findings: ArticleRank values provide a different ranking of a set of papers from that provided by the corresponding Times Cited values, and overcomes the inability of the latter to differentiate between papers with the same numbers of citations. The difference in rankings between Times Cited and ArticleRank is greatest for the most heavily cited articles in a dataset.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Valuing Indirect Citations in Citation Networks using Data Fusion

Any scientific activity requires awareness of previous related activities. Citation networks are the networks in which each document is compared as a link of a chain with its previous and next documents, and the documents with the highest number of citations are considered as the most effective ones in a domain. Most of the introduced methods use direct citations for valuing the documents. One ...

متن کامل

PageRank-based prediction of award-winning researchers and the impact of citations

In this article some recent disputes about the usefulness of PageRank-based methods for the task of identifying influential researchers in citation networks are discussed. In particular, it focuses on the performance of these methods in relation to simple citation counts. With the aim of comparing these two classes of ranking methods, we analyze a large citation network of authors based on almo...

متن کامل

Exploration and Evaluation of Citation Networks

This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into account not only the citations but also the coauthorship relationships. We verified the capabilities of the developed algorithms by applying them to the data from the DBLP digital library and subsequently by comparing th...

متن کامل

FutureRank: Ranking Scientific Articles by Predicting their Future PageRank

The dynamic nature of citation networks makes the task of ranking scientific articles hard. Citation networks are continually evolving because articles obtain new citations every day. For ranking scientific articles, we can define the popularity or prestige of a paper based on the number of past citations at the user query time; however, we argue that what is most useful is the expected future ...

متن کامل

Time-aware PageRank for bibliographic networks

In the past, recursive algorithms, such as PageRank originally conceived for the Web, have been successfully used to rank nodes in the citation networks of papers, authors, or journals. They have proved to determine prestige and not popularity, unlike citation counts. However, bibliographic networks, in contrast to the Web, have some specific features that enable the assigning of different weig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Aslib Proceedings

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2009